K-walks of Graphs
نویسندگان
چکیده
We obtain various sufficient conditions for a graph to have a spanning closed walk meeting each vertex exactly k times or meeting each vertex at most k times. In particular, we generalise the result of Oberly and Sumner that every connected, locally connected K l,3-free graph with at least three vertices is hamil tonian.
منابع مشابه
On a conjecture on k-walks of graphs
In this paper we give examples to show that a conjecture on k-walks of graphs, due to B. Jackson and N.C. Wormald, is false. We also give a maximum degree condition for the existence of k-walks and k-trees in 2-connected graphs.
متن کاملTight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the speed-up defined as the ratio between the cover time of one and the cover time of k random walks. Recently Alon et al. developed several bounds that are based on the quotient between the cover time and maximum hittin...
متن کاملA Property of Walks in Graphs
The aim of this note is to call attention to a peculiar odd–even regularity regarding the number of walks in a finite graph G: Let Wk denote the number of walks of length k (≥ 0) in G and put ∆k := Wk+1Wk−1−W 2 k (k ≥ 1) . Then • ∆2k−1 ≥ 0 holds for all k ≥ 1, • one has either ∆1 ≥ 0 and ∆k = 0 for all k ≥ 2 which holds if and only if G is harmonic (i.e. if and only if the degree map which asso...
متن کاملA Continuous - Time Quantum Walk for Attributed Graphs Matching
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this re...
متن کاملThe Complexity of Routing with Few Collisions
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph G with two distinct terminal vertices and two positive integers p and k, the question is whether one can connect the terminals by at least p routes (e.g. paths) such that at most k edges are time-wise shared among them. We study three types of routes: t...
متن کاملShortest walks in almost claw-free graphs
There have been many results concerning claw-free graphs and hamiltonicity. Recently, Jackson and Wormald have obtained more general results on walks in claw-free graphs. In this paper, we consider the family of almost claw-free graphs that contains the previous one, and give some results on walks, especially on shortest covering walks visiting only once some given vertices. Throughout the pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 2 شماره
صفحات -
تاریخ انتشار 1990